Networks and Graph Theory.
Main page.
This topic is divided into 4 main components:
| 1. The basic terms and concepts of Network analysis. |
| 2. Identifying special paths through a network. |
| 3. Implementing an activity or a project. |
| 4. Measuring the capacity of a network. |
In addition, the resources here provide a Summary of the main terms.
| The basic terms and concepts of a network. | |
| Basic concepts of networks and network diagrams. | |
| Basic concepts - Test Yourself 1. | |
| Basic concepts - Test Yourself 1 - Solutions. | |
| Planarity - a game to rearrange a network to eliminate crossing of edges. | |
| Walks and paths and other things. | |
| Walks & Paths - Test Yourself 1. | |
| Walks & Paths - Test Yourself 1 - Solutions. | |
| Networks and activity tables. | |
| Networks and tables - Test yourself 1. | |
| Networks and tables - Test yourself 1 - solutions. | |
| Identifying special paths through a network. | |
| Trees and spanning trees. | |
| Minimum spanning trees.
Kruskal's algorithm and Prim's algorithm. |
|
| Summary of the steps for Kruskal's algorithm. | |
| Summary of the steps for Prim's algorithm. | |
| Minimum spanning trees - Test Yourself 1. | |
| Minimum spanning trees - Test Yourself 1 - Solutions. |
|
| Determining the shortest path. | |
| Summary of the steps for Dijkstra's algorithm. | |
| Shortest path - Test Yourself 1. | |
| Shortest path - Test Yourself 1 - Solutions. | |
| Implementing an activity or a project. | |
| Activity charts. | |
| Drawing the network. | |
| Critical path analysis. | Video coming soon to a screen near you :-) |
| Critical path - Test Yourself 1. | |
| Critical path - Test Yourself 1 - Solutions. | |
| Measuring the capacity of a network. | |
| Flows through a network. | |